Algorithms For Computing Approximate Repetitions In Musical Sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for Computing Approximate Repetitions in Musical Sequences

Here we introduce two new notions of approximate matching with application in computer assisted music analysis. We present algorithms for each notion of approximation: for approximate string matching and for computing approximate squares.

متن کامل

Efficient Algorithms for the δ-Approximate String Matching Problem in Musical Sequences

The δ-approximate string matching problem, recently introduced in connection with applications to music retrieval, is a generalization of the exact string matching problem for alphabets of integer numbers. In the δ-approximate variant, (exact) matching between any pair of symbols/integers a and b is replaced by the notion of δ-matching =δ, where a =δ b if and only if |a− b| ≤ δ for a given valu...

متن کامل

Computing Evolutionary Chains in Musical Sequences

Musical patterns that recur in approximate, rather than identical, form within the body of a musical work are considered to be of considerable importance in music analysis. Here we consider the “evolutionary chain problem”: this is the problem of computing a chain of all “motif” recurrences, each of which is a transformation of (“similar” to) the original motif, but each of which may be progres...

متن کامل

Two-Pattern Strings — Computing Repetitions & Near-Repetitions

In a recent paper we introduced infinite two-pattern strings on the alphabet {a, b} as a generalization of Sturmian strings, and we posed three questions about them: • Given a finite string x, can we in linear time O(|x|) recognize whether or not x is a prefix/substring of some infinite two-pattern string? • If recognized as two-pattern, can all the repetitions in x be computed in linear time? ...

متن کامل

Imprecise Minority-Based Full Adder for ‎Approximate Computing Using CNFETs

   Nowadays, the portable multimedia electronic devices, which employ signal-processing modules, require power aware structures more than ever. For the applications associating with human senses, approximate arithmetic circuits can be considered to improve performance and power efficiency. On the other hand, scaling has led to some limitations in performance of nanoscale circuits. According...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Mathematics

سال: 2002

ISSN: 0020-7160,1029-0265

DOI: 10.1080/00207160213939